Smooth Surface Reconstruction from Sparse Data: Comparison of Svsf and 3dhm Algorithms

نویسندگان

  • Ahmad Almhdie
  • Christophe Léger
  • Maïtine Bergounioux
چکیده

We present in this paper an algorithm for surface reconstruction using thin plate splines on scattered patches or points on smooth surfaces. The algorithm is an improved version of Szeliski’s Variational Spline Fitting algorithm (SVSF). In particular, we introduce a different derivation of the discrete equations for the energy corresponding to the thin plat model. The results obtained on simulated data show that our proposed algorithm converges faster than the original algorithm. To complete this study, we also discuss the choice of the algorithm’s parameters in details using a cross validation technique. Finally, we compare our results to those obtained using a 3D Harmonic modelling (3DHM) Fourier-based algorithm (previously developed by the authors). We show that the proposed algorithm gives the best performance under a small sample size condition. However, when considering surfaces with a small percentage of the missing points, the 3DHM algorithm outperforms the other two spline-based algorithms.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Improved VSF Algorithm for Smooth Surface Reconstruction from Sparse Medical Data

This paper presents a ModifiedVariational Splines Fitting (MVSF) algorithm for surface reconstruction using thin plate splines on scattered patches or points of originally smooth surfaces. In particular, a more accurate derivation of the discrete equations for the energy corresponding to the thin plate model is introduced. The results obtained on simulated data show that the proposed algorithm ...

متن کامل

3D Surface Reconstruction from Unorganized Sparse Cross Sections

In this paper, we propose an algorithm for closed and smooth 3D surface reconstruction from unorganized planar cross sections. We address the problem in its full generality, and show its effectiveness on sparse set of cutting planes. Our algorithm is based on the construction of a globally consistent signed distance function over the cutting planes. It uses a split-and-merge approach utilising ...

متن کامل

Reconstructing Surfaces by Volumetric Regularization Using Radial Basis Functions

| We present a new method of surface reconstruction that generates smooth and seamless models from sparse, noisy, non-uniform, and low resolution range data. Data acquisition techniques from computer vision, such as stereo range images and space carving, produce 3D point sets that are imprecise and non-uniform when compared to laser or optical range scanners. Traditional reconstruction algorith...

متن کامل

Hyperspectral Image Classification Based on the Fusion of the Features Generated by Sparse Representation Methods, Linear and Non-linear Transformations

The ability of recording the high resolution spectral signature of earth surface would be the most important feature of hyperspectral sensors. On the other hand, classification of hyperspectral imagery is known as one of the methods to extracting information from these remote sensing data sources. Despite the high potential of hyperspectral images in the information content point of view, there...

متن کامل

Fast Reconstruction of SAR Images with Phase Error Using Sparse Representation

In the past years, a number of algorithms have been introduced for synthesis aperture radar (SAR) imaging. However, they all suffer from the same problem: The data size to process is considerably large. In recent years, compressive sensing and sparse representation of the signal in SAR has gained a significant research interest. This method offers the advantage of reducing the sampling rate, bu...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2004